Open problems on graph eigenvalues studied with AutoGraphiX
نویسندگان
چکیده
منابع مشابه
On Open Problems of Nonnegative Inverse Eigenvalues Problem
In this paper, we give solvability conditions for three open problems of nonnegative inverse eigenvalues problem (NIEP) which were left hanging in the air up to seventy years. It will offer effective ways to judge an NIEP whether is solvable.
متن کاملSome Open Problems on Graph Labelings
In this note we present some of the open problems on various aspects of graph labelings which were posed by the participants during IWOGL 2009 and which have not been included in any of the other papers appearing in this volume.
متن کاملOpen Problems #21 Graph Pebbling
Tom Trotter of Arizona State has settled Gra-ham Brightwell's problem about fractional dimension posed in Open Problems #20. Recall that the fractional dimension dim (P) is the minimum total weight assigned to the linear extensions of P so that each ordered incomparable pair is covered with total weight at least 1. Brightwell asked whether there exists a function f such that every n-element pos...
متن کاملBounds on graph eigenvalues I
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of order n 2; maximum degree ; and girth at least 5; then
متن کاملBounds on graph eigenvalues II
We prove three results about the spectral radius μ (G) of a graph G : (a) Let Tr (n) be the r-partite Turán graph of order n. If G is a Kr+1-free graph of order n, then μ (G) < μ (Tr (n)) unless G = Tr (n) . (b) For most irregular graphs G of order n and size m, μ (G)− 2m/n > 1/ (2m+ 2n) . (c) Let 0 ≤ k ≤ l. If G is a graph of order n with no K2 +Kk+1 and no K2,l+1, then μ (G) ≤ min {
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2012
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-012-0001-9